a__and(tt, X) → mark(X)
a__plus(N, 0) → mark(N)
a__plus(N, s(M)) → s(a__plus(mark(N), mark(M)))
mark(and(X1, X2)) → a__and(mark(X1), X2)
mark(plus(X1, X2)) → a__plus(mark(X1), mark(X2))
mark(tt) → tt
mark(0) → 0
mark(s(X)) → s(mark(X))
a__and(X1, X2) → and(X1, X2)
a__plus(X1, X2) → plus(X1, X2)
↳ QTRS
↳ DependencyPairsProof
a__and(tt, X) → mark(X)
a__plus(N, 0) → mark(N)
a__plus(N, s(M)) → s(a__plus(mark(N), mark(M)))
mark(and(X1, X2)) → a__and(mark(X1), X2)
mark(plus(X1, X2)) → a__plus(mark(X1), mark(X2))
mark(tt) → tt
mark(0) → 0
mark(s(X)) → s(mark(X))
a__and(X1, X2) → and(X1, X2)
a__plus(X1, X2) → plus(X1, X2)
A__PLUS(N, s(M)) → A__PLUS(mark(N), mark(M))
A__PLUS(N, s(M)) → MARK(M)
MARK(s(X)) → MARK(X)
MARK(and(X1, X2)) → A__AND(mark(X1), X2)
MARK(and(X1, X2)) → MARK(X1)
MARK(plus(X1, X2)) → MARK(X1)
A__PLUS(N, 0) → MARK(N)
MARK(plus(X1, X2)) → A__PLUS(mark(X1), mark(X2))
MARK(plus(X1, X2)) → MARK(X2)
A__PLUS(N, s(M)) → MARK(N)
A__AND(tt, X) → MARK(X)
a__and(tt, X) → mark(X)
a__plus(N, 0) → mark(N)
a__plus(N, s(M)) → s(a__plus(mark(N), mark(M)))
mark(and(X1, X2)) → a__and(mark(X1), X2)
mark(plus(X1, X2)) → a__plus(mark(X1), mark(X2))
mark(tt) → tt
mark(0) → 0
mark(s(X)) → s(mark(X))
a__and(X1, X2) → and(X1, X2)
a__plus(X1, X2) → plus(X1, X2)
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
A__PLUS(N, s(M)) → A__PLUS(mark(N), mark(M))
A__PLUS(N, s(M)) → MARK(M)
MARK(s(X)) → MARK(X)
MARK(and(X1, X2)) → A__AND(mark(X1), X2)
MARK(and(X1, X2)) → MARK(X1)
MARK(plus(X1, X2)) → MARK(X1)
A__PLUS(N, 0) → MARK(N)
MARK(plus(X1, X2)) → A__PLUS(mark(X1), mark(X2))
MARK(plus(X1, X2)) → MARK(X2)
A__PLUS(N, s(M)) → MARK(N)
A__AND(tt, X) → MARK(X)
a__and(tt, X) → mark(X)
a__plus(N, 0) → mark(N)
a__plus(N, s(M)) → s(a__plus(mark(N), mark(M)))
mark(and(X1, X2)) → a__and(mark(X1), X2)
mark(plus(X1, X2)) → a__plus(mark(X1), mark(X2))
mark(tt) → tt
mark(0) → 0
mark(s(X)) → s(mark(X))
a__and(X1, X2) → and(X1, X2)
a__plus(X1, X2) → plus(X1, X2)
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
A__PLUS(N, s(M)) → MARK(M)
MARK(and(X1, X2)) → A__AND(mark(X1), X2)
MARK(and(X1, X2)) → MARK(X1)
MARK(plus(X1, X2)) → MARK(X1)
A__PLUS(N, 0) → MARK(N)
MARK(plus(X1, X2)) → A__PLUS(mark(X1), mark(X2))
MARK(plus(X1, X2)) → MARK(X2)
A__PLUS(N, s(M)) → MARK(N)
Used ordering: Polynomial interpretation [25,35]:
A__PLUS(N, s(M)) → A__PLUS(mark(N), mark(M))
MARK(s(X)) → MARK(X)
A__AND(tt, X) → MARK(X)
The value of delta used in the strict ordering is 1.
POL(a__plus(x1, x2)) = 2 + x_1 + (4)x_2
POL(A__AND(x1, x2)) = (2)x_2
POL(plus(x1, x2)) = 2 + x_1 + (4)x_2
POL(A__PLUS(x1, x2)) = 1 + x_1 + (4)x_2
POL(MARK(x1)) = x_1
POL(tt) = 0
POL(a__and(x1, x2)) = 4 + (4)x_1 + (2)x_2
POL(mark(x1)) = x_1
POL(s(x1)) = x_1
POL(and(x1, x2)) = 4 + (4)x_1 + (2)x_2
POL(0) = 2
a__plus(N, s(M)) → s(a__plus(mark(N), mark(M)))
mark(plus(X1, X2)) → a__plus(mark(X1), mark(X2))
mark(and(X1, X2)) → a__and(mark(X1), X2)
a__plus(N, 0) → mark(N)
a__and(tt, X) → mark(X)
mark(tt) → tt
mark(s(X)) → s(mark(X))
mark(0) → 0
a__plus(X1, X2) → plus(X1, X2)
a__and(X1, X2) → and(X1, X2)
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ DependencyGraphProof
A__PLUS(N, s(M)) → A__PLUS(mark(N), mark(M))
MARK(s(X)) → MARK(X)
A__AND(tt, X) → MARK(X)
a__and(tt, X) → mark(X)
a__plus(N, 0) → mark(N)
a__plus(N, s(M)) → s(a__plus(mark(N), mark(M)))
mark(and(X1, X2)) → a__and(mark(X1), X2)
mark(plus(X1, X2)) → a__plus(mark(X1), mark(X2))
mark(tt) → tt
mark(0) → 0
mark(s(X)) → s(mark(X))
a__and(X1, X2) → and(X1, X2)
a__plus(X1, X2) → plus(X1, X2)
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
MARK(s(X)) → MARK(X)
a__and(tt, X) → mark(X)
a__plus(N, 0) → mark(N)
a__plus(N, s(M)) → s(a__plus(mark(N), mark(M)))
mark(and(X1, X2)) → a__and(mark(X1), X2)
mark(plus(X1, X2)) → a__plus(mark(X1), mark(X2))
mark(tt) → tt
mark(0) → 0
mark(s(X)) → s(mark(X))
a__and(X1, X2) → and(X1, X2)
a__plus(X1, X2) → plus(X1, X2)
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
MARK(s(X)) → MARK(X)
The value of delta used in the strict ordering is 4.
POL(MARK(x1)) = (4)x_1
POL(s(x1)) = 1 + (4)x_1
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
↳ QDP
a__and(tt, X) → mark(X)
a__plus(N, 0) → mark(N)
a__plus(N, s(M)) → s(a__plus(mark(N), mark(M)))
mark(and(X1, X2)) → a__and(mark(X1), X2)
mark(plus(X1, X2)) → a__plus(mark(X1), mark(X2))
mark(tt) → tt
mark(0) → 0
mark(s(X)) → s(mark(X))
a__and(X1, X2) → and(X1, X2)
a__plus(X1, X2) → plus(X1, X2)
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDPOrderProof
A__PLUS(N, s(M)) → A__PLUS(mark(N), mark(M))
a__and(tt, X) → mark(X)
a__plus(N, 0) → mark(N)
a__plus(N, s(M)) → s(a__plus(mark(N), mark(M)))
mark(and(X1, X2)) → a__and(mark(X1), X2)
mark(plus(X1, X2)) → a__plus(mark(X1), mark(X2))
mark(tt) → tt
mark(0) → 0
mark(s(X)) → s(mark(X))
a__and(X1, X2) → and(X1, X2)
a__plus(X1, X2) → plus(X1, X2)
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
A__PLUS(N, s(M)) → A__PLUS(mark(N), mark(M))
The value of delta used in the strict ordering is 2.
POL(a__plus(x1, x2)) = (2)x_1 + x_2
POL(plus(x1, x2)) = (2)x_1 + x_2
POL(A__PLUS(x1, x2)) = (2)x_2
POL(tt) = 0
POL(a__and(x1, x2)) = x_1 + (4)x_2
POL(mark(x1)) = x_1
POL(s(x1)) = 1 + x_1
POL(and(x1, x2)) = x_1 + (4)x_2
POL(0) = 4
mark(tt) → tt
mark(s(X)) → s(mark(X))
mark(0) → 0
a__plus(X1, X2) → plus(X1, X2)
a__and(X1, X2) → and(X1, X2)
a__plus(N, s(M)) → s(a__plus(mark(N), mark(M)))
mark(plus(X1, X2)) → a__plus(mark(X1), mark(X2))
mark(and(X1, X2)) → a__and(mark(X1), X2)
a__plus(N, 0) → mark(N)
a__and(tt, X) → mark(X)
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
a__and(tt, X) → mark(X)
a__plus(N, 0) → mark(N)
a__plus(N, s(M)) → s(a__plus(mark(N), mark(M)))
mark(and(X1, X2)) → a__and(mark(X1), X2)
mark(plus(X1, X2)) → a__plus(mark(X1), mark(X2))
mark(tt) → tt
mark(0) → 0
mark(s(X)) → s(mark(X))
a__and(X1, X2) → and(X1, X2)
a__plus(X1, X2) → plus(X1, X2)